Analysis of Normal Logic Programs
نویسندگان
چکیده
In this paper we present a dataaow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.
منابع مشابه
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as negation, compilation, memoization, static analysis, program approximation by neural networks etc. As a consequence, the absence of local variables yields better performance of several tools and is a prerequisite for ...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملSkeptical Reasoning in FC-Normal Logic Programs is P11-complete
FC-normal logic programs are a generalization by Marek, Nerode, and Remmel of Reiter’s normal default theories. They have the property that, unlike most logic programs, they are guaranteed to have simple stable models. In this paper it is shown that the problem of skeptical reasoning in FC-normal programs is Π1-complete, the same complexity as for logic programs without the restriction of FC-no...
متن کاملOn Extended Disjunctive Logic Programs
This paper studies, in a comprehensive manner, diierent aspects of extended disjunctive logic programs, that is, programs whose clauses are of the form l 1 not is the negation-by-default operator. The explicit use of classical negation suggests the introduction of a new truth value, namely, logical falsehood (in contrast to falsehood-by-default) in the semantics. General techniques are describe...
متن کاملExtending Logic Programs with Description Logic Expressions for the Semantic Web
Recently much attention has been directed to extending logic programming with description logic (DL) expressions, so that logic programs have access to DL knowledge bases and thus are able to reason with ontologies in the Semantic Web. In this paper, we propose a new extension of logic programs with DL expressions, called normal DL logic programs. In a normal DL logic program arbitrary DL expre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998